Circulating Decimals
نویسندگان
چکیده
منابع مشابه
Note on Normal Decimals
It was proved by Champernowne [2] that the decimal . 1234567891011 . . . is normal, and by Besicovitch [11 that the same holds for the decimal . 1491625 . . . . Copeland and Erdös [3] have proved that if p i, P2 . . . . is any sequence of positive integers such that, for every 0 < 1, the number of p's up to n exceeds nB if n is sufficiently large, then the infinite decimal •p ip 2p 3 . . . is n...
متن کاملDistant decimals of $\pi$
We describe how to compute very far decimals of π and how to provide formal guarantees that the decimals we compute are correct. In particular, we report on an experiment where 1 million decimals of π and the billionth hexadecimal (without the preceding ones) have been computed in a formally verified way. Three methods have been studied, the first one relying on a spigot formula to obtain at a ...
متن کاملSMARAl~ACHE CONCATENATED POWER DECIMALS
In this paper we prove that all Smarandache concatenated k-power decimals are irrational numbers. For any positive integer k, we define the Smarandache concatenated k-power decimal a k as follows: a l = 0.1234567891011..., a2 = 0.149162536496481100121... (1) a 3 = 0.18276412521634351272910001331..., ... , etc. In this peper we discuss the irrationally of ak' We prove the following result Theore...
متن کاملGeneralizations of Midy’s Theorem on Repeating Decimals
Let n denote a positive integer relatively prime to 10. Let the period of 1/n be a · b with b > 1. Break the repeating block of a · b digits up into b sub blocks, each of length a, and let B(n, a, b) denote the sum of these b blocks. In 1836, E. Midy proved that if p is a prime greater than 5, and the period of 1/p is 2 · a, then B(p, a, 2) = 10 − 1. In 2004, B. Ginsberg [2] showed that if p is...
متن کاملDivisibility Tests and Recurring Decimals in Euclidean Domains
In this article, we try to explain and unify standard divisibility tests found in various books. We then look at recurring decimals, and list a few of their properties. We show how to compute the number of digits in the recurring part of any fraction. Most of these results are accompanied by a proof (along with the assumptions needed), that works in a Euclidean domain. We then ask some question...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1878
ISSN: 0028-0836,1476-4687
DOI: 10.1038/018541a0